Non First Normal Form relations: An algebra allowing data restructuring
نویسندگان
چکیده
منابع مشابه
On Restructuring Nested Relations in Partitioned Normal Form
Relations in partitioned normal form are an important subclass of nested relations. This paper is concerned with the problem of restructuring relations in partitioned normal form to new and potentially very different schemes. The main problem with restructuring is to minimize the amount of information lost during the transformation. A new restructuring operator is defined which minimizes that l...
متن کاملRestructuring Partitioned Normal Form Relations without Information Loss
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that are useful in many applications. In this paper we address the question of determining when every PNF relation stored under one nested relation scheme can be transformed into another PNF relation stored under a different nested relation scheme without loss of information, referred to as the two s...
متن کاملNormal Form in DI-Algebra with Recursion
DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a normal form for finite expressions can be defined. Unlike most process algebras, however, we show that we can also define a normal form for recursive expressions. This is done by first eliminating operators using the laws of the algebra and then minimizing cycles in a state graph.
متن کاملUser Interface Techniques based on the Non-First Normal-Form Data Model
Abstract. This paper compares graph-oriented with tabular representations in the context of database editors and argues that displaying data in tables is to be preferred on the instance level. In particular, nested tables are advocated and design and user interaction issues for a database editor based on this complex object data model are described. This then leads to the concept of spatial cur...
متن کاملLinear Induction Algebra and a Normal Form for Linear Operators
The set of natural integers is fundamental for at least two reasons: it is the free induction algebra over the empty set (and at such allows definitions of maps by primitive recursion) and it is the free monoid over a one-element set, the latter structure being a consequence of the former. In this contribution, we study the corresponding structure in the linear setting, i.e. in the category of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1986
ISSN: 0022-0000
DOI: 10.1016/0022-0000(86)90058-9